Single Machine Scheduling to Minimize Weighted Earliness Subject to Ready and Due Times

Single machine scheduling with controllable processing times to minimize total tardiness and earliness

0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...

Single Machine Scheduling to Minimize Total Weighted Late Work

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

The single resource scheduling problem is commonly applicable in practice not only when there is a single resource but also in some multiple-resource production systems where only one of the resources is bottle neck. Thus, the single resource (machine) scheduling problem has been widely addressed in the scheduling literature. In this paper, the single machine scheduling problem with uncertain a...

Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine

We consider the problem of scheduling a set of jobs on a single machine with the objective of minimizing sum of weighted completion times. The problem is NP-hard when there are precedence constraints between jobs 15]. We provide an eecient com-binatorial 2-approximation algorithm for this problem. In contrast to our work, earlier approximation algorithms 12] achieving constant factor approximat...

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...